Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017     

Rényi信息增量和协方差联合控制的多传感器管理算法

针对目标跟踪中雷达组网场景下多传感器管理问题,结合Rényi信息增量和协方差两种算法各自特性,利用并行处理的思想提出了一种基于Rényi信息增量和协方差联合控制的传感器管理算法。在具体仿真设计环节,分为传感器跟踪能力大于目标数和传感器跟踪能力小于目标数两种场景。仿真结果表明该算法在单目标匀速、多目标匀加速等多数场景下能够对目标进行有效跟踪,同时降低了传感器的切换频率,具有更好的实时性。     

地籍数据库点线拓扑一致性并行检查方法

针对拓扑检查算法复杂、计算量大,串行计算已远不能满足海量地籍数据高效拓扑检查需求的问题,在分析了点线拓扑关系的并行特点基础上,将界址点的数据划分方法与界址线的QR空间索引方法相结合,实现了界址点与界址线的并行拓扑计算。用某地区实际的界址点集与界址线集对点线拓扑并行检查进行实验。测试结果表明:并行检查算法的并行效率随着进程数的增加而有所衰减,但稳定在30%以上,加速比达到5以上,且相比于Arc GIS效率提升了30倍以上。并行检查方法以工具的方式集成应用于高性能地理计算平台中,应用效果良好。     

基于GAHP的模糊综合评判法在潜艇 作战方案评估中的应用

潜艇作战方案评估是辅助对潜指挥员决策的重要方法,而评估的科学性对决策的有效性影响很大.利用多人层次分析法(GAHP)和模糊综合评判相结合的方法,对潜艇作战方案进行评估,评估的结果可信度高,有利于对潜指挥员的正确决策.最后,通过实例证明了方法的有效性.     

基于满足率的随舰备件配置方案

针对满足率只有统计定义的问题,从不同角度研究了备件满足率的概率性质,给出了满足率的两种概率模型,揭示了满足率的内涵和实际工程意义。在此基础上,给出了系统备件保障满足率的概率定义,建立了以系统备件满足率为约束、备件总重量最小为目标的随舰备件配置优化模型,研究了优化模型的边际效益算法。实例分析表明：该方法为合理制定舰艇随舰备件保障方案提供了决策依据。     

用于海底观测网络的海缆远程供电系统的可靠性

提出了串联恒流和并联恒压两种适合应用于海底观测网络的远程供电系统方案;在相同条件下,利用算法分别完成了两种系统的可靠性设计与分配方案,并根据各子单元的分配可靠度计算了两种系统各节点的供电可靠度。分析结果表明：相比于并联恒压远供系统,串联恒流远供系统对子单元的要求相对较低,而各节点的供电可靠度相对较高,说明串联恒流远供系统更适合应用于我国的海底观测网络建设。     

基于压力间断解析解对AUSM -up格式的修正*

AUSM -up格式是AUSM类系列格式中最完善的,通过在对流通量中引入压力耗散,同时在压力通量中引入速度耗散,使之在各种马赫数下均有良好的收敛性和稳定性。然而,通过对格式的分析,我们发现当马赫数为零时,在压力间断位置会出现质量通量无穷大的非物理现象。为了克服这一缺陷,采用特征线法获得了压力间断问题的解析解;以此为基础,对对流通量中的压力耗散项进行修正,发展出新的AUSM -up格式。以新的格式对不同速度驱动下的冲击波发展、不同强度压力间断问题和激波衍射问题进行了仿真,计算结果与理论解吻合得较好。     

一个二阶精度的大粒子有限体积方法

对二维Euler方程给出一个二阶精度的非结构网格有限体积方法,方法的主要思想是把Euler方程的一个时间步分两步计算:第一步只考虑压力加速效应,第二步再考虑输运效应,离散过程中采用一种具有最小二乘思想的线性重构函数以计算交界面的流通量,数值实验表明该方法是非常有效的。     

三轴光纤陀螺复用方案的初步探讨

分析了三轴光纤陀螺组合技术方案的光路和电路结构,设计了一种三轴光纤陀螺时分复用方案,对比了试验样机分时与不分时的性能指标．